Cubical Representation and Minimization through Cubical Technique A Tabular Approach
نویسندگان
چکیده
Tables, Boolean Laws and different traits of Karnaugh Maps are used generally to establish a solution of Boolean equations. Cubical representation is another option to help in getting a solution of equations. Largest possible k-cubes that exist for a given function are equivalent to its prime implicants. A technique of minimization of Logic functions is tried to be achieved through cubical methods. Further in the paper a Tabular method for minimization has been discussed with a touch of cubical approach, apart from basic rudimentary and pivotal approach of Quine Mc clusky method. The main purpose is to make aware and utilise the advantages of cubical techniques in minimization of Logic functions. All this is done with an aim to achieve minimal cost solution.
منابع مشابه
Prime and Essential Prime Implicants of Boolean Functions through Cubical Representation
K Maps are generally and ideally , thought to be simplest form for obtaining solution of Boolean equations.Cubical Representation of Boolean equations is an alternate pick to incur a solution, otherwise to be meted out with Truth Tables, Boolean Laws and different traits of Karnaugh Maps. Largest possible kcubes that exist for a given function are equivalent to its prime implicants. A technique...
متن کاملEdge Expansion of Cubical Complexes
In this paper we show that graphs of “neighbourly” cubical complexes – cubical complexes in which every pair of vertices spans a (unique) cube – have good expansion properties, using a technique based on multicommodity flows. By showing that graphs of stable set polytopes are graphs of neighbourly cubical complexes we give a new proof that graphs of stable set polytopes have edge expansion 1.
متن کاملGeneration of Octrees from Raster Scan with Reduced Information Loss
Having addressed the issue ofgenerating octrees from raster scan efficiently using parallel computation, it is worthwhile to ensure that the encoding is accomplished without much loss of information. Knowing that each cube usually stores an average ofthe intensity value in the cubical subspace, the encoding could lead to a "blocky" (as against ''patchy'') solid during regeneration. Retaining th...
متن کاملCubical token systems
The paper deals with combinatorial and stochastic structures of cubical token systems. A cubical token system is an instance of a token system, which in turn is an instance of a transition system. It is shown that some basic results of combinatorial and stochastic parts of media theory hold almost in identical form for cubical token systems, although some underlying concepts are quite different...
متن کاملTopology-preserving digitization of n-dimensional objects by constructing cubical models
This paper proposes a new cubical space model for the representation of continuous objects and surfaces in the n-dimensional Euclidean space by discrete sets of points. The cubical space model concerns the process of converting a continuous object in its digital counterpart, which is a graph, enabling us to apply notions and operations used in digital imaging to cubical spaces. We formulate a d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016